A Construction of H-antimagic Graphs
نویسندگان
چکیده
منابع مشابه
Super ( , - Edge - Antimagic Graphs
A graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a one-to-one and onto mapping f from ∪ , ,... , such that the edge weights , ∈ form an AP progression with first term ’a’ and common difference ’d’. The graph G is said to be Super (a,d)-edge-antimagic total labeling if the , , ... , . In this paper we obtain Super (a,d)-edge-antimagic properties of certain cla...
متن کاملRegular Graphs are Antimagic
In this note we prove with a slight modification of an argument of Cranston et al. [2] that k-regular graphs are antimagic for k ≥ 2.
متن کاملTotally antimagic total graphs
For a graph G a bijection from the vertex set and the edge set of G to the set {1, 2, . . . , |V (G)| + |E(G)|} is called a total labeling of G. The edge-weight of an edge is the sum of the label of the edge and the labels of the end vertices of that edge. The vertex-weight of a vertex is the sum of the label of the vertex and the labels of all the edges incident with that vertex. A total label...
متن کاملDense graphs are antimagic
An antimagic labeling of a graph with m edges and n vertices is a bijection from the set of edges to the integers 1, . . . ,m such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with the same vertex. A graph is called antimagic if it has an antimagic labeling. A conjecture of Ringel (see [4]) states that every connected graph, but K2,...
متن کاملOn antimagic directed graphs
An antimagic labeling of an undirected graph G with n vertices and m edges is a bijection from the set of edges of G to the integers {1, . . . ,m} such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with that vertex. A graph is called antimagic if it admits an antimagic labeling. In [6], Hartsfield and Ringel conjectured that every si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Mechanica Slovaca
سال: 2015
ISSN: 1335-2393,1339-3073
DOI: 10.21496/ams.2015.017